Enhancement of the Ground Processing Scheduling System (gpss)
نویسندگان
چکیده
A scheduling process that maintains, repairs and configures a space shuttle orbiter must satisfy temporal, resource and configuration constraints. The GPSS, which stands for ground processing scheduling system, has been successfully used to schedule tasks that prepare an orbiter for its next launch. The objective of this project is to enhance and to improve the GPSS. The GPSS uses an iterative repair method that starts with a rough schedule, which satisfies only the temporal constraints. Then it repairs the resource and configuration constraint violations one by one until no more violations exist or no further improvements can be made. The conflict resolution, which repairs all the resource and the configuration constraint violations, forms the bulk of the cognitive and computational complexity of the system. We started with a study of the solution space of the GPSS which will help us to develop algorithms and strategies to improve the efficiency of the deconfliction process. To our knowledge there has been no previous effort to obtain this solution space. We probed the existing GPSS and constructed its solution spaces. The total number of iterations during the deconfliction process depends on the quality of the initial schedule better the quality the smaller the number of iterations. The quality of the initial schedule can be improved by applying a genetic algorithm on an abstract problem generated from the original problem. We have designed and developed a genetic algorithm and interfaced with the GPSS to generate a feasible schedule that satisfies temporal and resource constraints. Further, the computational efficiency of the deconfliction portion of the GPSS can be improved by using better heuristic strategies and better cost estimators instead of actually computing the cost for the heuristic table. The heuristic table used in the GPSS is very static, and the normalization process is somewhat arbitrary. We have designed and developed an evolutionary learning technique and interfaced it with the GPSS so as to learn the appropriate ways of combining the heuristic parameters and thereby reduce conflicts faster.
منابع مشابه
Enhancements to the Ground ProcessingScheduling SystemJuan
This paper describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraint-based scheduler that deals with three kinds of constraints: temporal, resource, and connguration. It starts with a complete schedule that may have some constraint violations (connicts) and gradually improves the schedule by reducing the violations. The obj...
متن کاملEnhancements to the Ground Processing Scheduling System
This research statement describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraintbased scheduler that, using an anytime algorithm, deals with three kinds of constraints: temporal, resource, and configuration. It starts with a complete schedule that may have some constraint violations (conflicts) and gradually improves the s...
متن کاملStatic Security Constrained Generation Scheduling Using Sensitivity Characteristics of Neural Network
This paper proposes a novel approach for generation scheduling using sensitivitycharacteristic of a Security Analyzer Neural Network (SANN) for improving static securityof power system. In this paper, the potential overloading at the post contingency steadystateassociated with each line outage is proposed as a security index which is used forevaluation and enhancement of system static security....
متن کاملزمانبندی گروهی با در نظر گرفتن اثر یادگیری در سیستم تولید سلولی
The group scheduling problem in the cellular manufacturing system is comprised of two levels of scheduling. At the first level, the sequence of parts in each part-family is determined, and then at the second level the sequence of part-families is determined. In this paper, the flow shop group scheduling is investigated in order to minimize the makespan. In traditional group scheduling problems,...
متن کاملArtificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...
متن کامل